Finding the Medial Axis of a Simple Polygon in Linear Time
نویسندگان
چکیده
We give a linear-time algorithm for computing the medial axis of a simple polygon P, This answers a long-standing open question|previously, the best deterministic algorithm ran in O(n log n) time. We decompose P into pseudo-normal histograms, then innuence histograms and xy monotone histograms. We can compute the medial axes for xy monotone his-tograms and merge to obtain the medial axis for P.
منابع مشابه
Finding a minimal tree in a polygon with its medial axis
In order to solve a problem arising when generalizing topographical maps, we consider the following problem for simple polygons, i.e., coherent polygons without holes. Some edges of the polygon may be marked as hard, and at least two vertices of the polygon are marked as terminals. We show that the problem to nd a tree of minimum total length, spanning the hard edges and terminals, using only e...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملCalculations of Dihedral Groups Using Circular Indexation
In this work, a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$. Each element of the sequence represents a vertex of the polygon. Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. Here each symmetry is considered as a system that takes an input circular sequence and g...
متن کاملA Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. The wavefront is linear and propagates by translating edges at constant speed. The initial wavefront is an altered version of the original polygon: zero-length edges are added at reflex vertices. The linear axis is a su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 21 شماره
صفحات -
تاریخ انتشار 1995